A Note on K-Best Solutions to the Chinese Postman Problem

The K-best problems on combinatorial optimization problems, in which K best solutions are considered instead of an optimal solution under the same conditions, have widely been studied. In this paper, we consider the K-best problem on the famous Chinese postman problem and develop an algorithm that nds K best solutions. The time complexity of our algorithm is O(S(n;m) + K(n + m + logK + nT (n +m;m))) where S(s; t) denotes the time complexity of an algorithm for ordinary Chinese postman problems and T (s; t) denotes the time complexity of a post optimal algorithm for non-bipartite matching problems de ned on a graph with s vertices and t edges.